Determination of accuracy value in id3 algorithm with gini index and gain ratio with minimum size for split, minimum leaf size, and minimum gain

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

(H, k) stable graphs with minimum size

Let us call a G (H, k) graph vertex stable if it contains a subgraph H ever after removing any of its k vertices. By Q(H, k) we will denote the minimum size of an (H, k) vertex stable graph. In this paper, we are interested in finding Q(C3, k), Q(C4, k), Q(K1,p, k) and Q(Ks, k).

متن کامل

Minimum Size Tree-decompositions

We study in this paper the problem of computing a tree-decomposition of a graph with width at most k and minimum number of bags. More precisely, we focus on the following problem: given a fixed k ≥ 1, what is the complexity of computing a treedecomposition of width at most k with minimum number of bags in the class of graphs with treewidth at most k? We prove that the problem is NP-complete for...

متن کامل

Pm-saturated bipartite graphs with minimum size

A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and adding any new edge to G creates a copy of H in G. In 1986 L. Kászonyi and Zs. Tuza considered the following problem: for given m and n find the minimum size sat(n;Pm) of Pm-saturated graph of order n. They gave the number sat(n;Pm) for n big enough. We deal with similar problem for bipartite graphs.

متن کامل

Graph Partition Problems with Minimum Size Constraints

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x

متن کامل

A Model and Algorithm for Computing Minimum-Size Test Patterns

This paper addresses the problem of test pattern generation for single stuck-at faults in combinational circuits, under the additional constraint that the number of specified primary input assignments is minimized. This problem has different applications in testing, including the identification of don’t care conditions to be used in the synthesis of Built-In SelfTest (BIST) logic. The proposed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IOP Conference Series: Materials Science and Engineering

سال: 2020

ISSN: 1757-899X

DOI: 10.1088/1757-899x/725/1/012088